Monomial geometric programming with fuzzy relation inequality constraints with max-product composition
نویسندگان
چکیده
Monomials function has always been considered as a significant and most extensively used function in real living. Resource allocation, structure optimization and technology management can often apply these functions. In optimization problems the objective functions can be considered by monomials. In this paper, we present monomials geometric programming with fuzzy relation inequalities constraint with max-product composition. Simplification operations have been given to accelerate the resolution of the problem by removing the components having no effect on the solution process. Also, an algorithm and a few practical examples are presented to abbreviate and illustrate the steps of the problem resolution. 2008 Elsevier Ltd. All rights reserved.
منابع مشابه
Linear Objective Function Optimization with the Max-product Fuzzy Relation Inequality Constraints
In this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. Since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. We study this problem and capture some special characteristics of its feasible domain and optimal s...
متن کاملOptimization of linear objective function subject to Fuzzy relation inequalities constraints with max-product composition
In this paper, we study the finitely many constraints of the fuzzyrelation inequality problem and optimize the linear objectivefunction on the region defined by the fuzzy max-product operator.Simplification operations have been given to accelerate theresolution of the problem by removing the components having noeffect on the solution process. Also, an algorithm and somenumerical and applied exa...
متن کاملSeparable programming problems with the max-product fuzzy relation equation constraints
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
متن کاملPosynomial geometric programming problem subject to max–product fuzzy relation equations
In this article, we study a class of posynomial geometric programming problem (PGPF), with the purpose of minimizing a posynomial subject to fuzzy relational equations with max–product composition. With the help of auxiliary variables, it is converted convert the PGPF into an equivalent programming problem whose objective function is a non-decreasing function with an auxiliary variable. Some pr...
متن کاملMonomial geometric programming with fuzzy relation equation constraints
In this paper, an optimization model with an objective function as monomial subject to a system of the fuzzy relation equations with max-bounded difference (maxBD) composition operator is presented. We firstly determine its feasible solution set. Then some special characteristics of its feasible domain and the optimal solutions are studied. Some procedures for reducing and decomposing the probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Industrial Engineering
دوره 56 شماره
صفحات -
تاریخ انتشار 2009